Formal Analysis of Consensus Protocols in Asynchronous Distributed Systems
نویسنده
چکیده
This paper presents a formal veri cation of two consensus protocols for distributed systems presented in [T. Deepak Chandra and S. Toueg, Unreliable failure detectors for reliable distributed systems, J. ACM, 1996]. These two protocols rely on two underlying failure detection protocols. We formalize an abstract model of the underlying failure detection protocols and building upon this abstract model, formalize the two consensus protocols. We prove that both algorithms satisfy the properties of uniform agreement , uniform integrity , termination and uniform validity assuming the correctness of their corresponding failure detectors.
منابع مشابه
Making Consensus Practical
This paper presents the abstraction of lazy consensus and argues for its use as an effective component for building distributed agreement protocols in practical asynchronous systems where processes and links can crash and recover. Lazy consensus looks like consensus, is equivalent to consensus, but is not consensus. The specification of lazy consensus has an ondemand and a re-entrant flavors th...
متن کاملOn the Possibility of Consensus in Asynchronous Systems
We demonstrate that the leader election and consensus problems are solvable in a timed asynchronous distributed system provided a majority of processes are always eventually able to communicate in a timely manner for a su ciently long time. Failures and recoveries a ecting the other processes and the communications between them do not prevent consensus. The timed asynchronous system model descr...
متن کاملA Case Study of Agreement Problems in Distributed Systems: Non-Blocking Atomic Commitment
This paper considers an agreement problem whose practical interest is well known, namely the Non-Blocking Atomic Commitment Problem. First, a generic protocol solving this problem is given and then instantiations of its generic statements are provided for both synchronous and asynchronous distributed systems. These instantiations use a few basic components: timeout mechanism and reliable multic...
متن کاملThe Sleepy Model of Consensus
The distributed systems literature adopts two primary network models, the synchronous model where honest messages are delivered in the next round, and the partially synchronous (or asynchronous) model where honest messages are subject to unpredictable adversarial delays. In this paper, we show that more nuanced formal models exist beyond the traditional synchrony and asynchrony stratification —...
متن کاملA Low-Cost Non-Blocking Atomic Commitment Protocol for Asynchronous Systems
In distributed transactional systems, an Atomic Commitment Protocol (ACP) is used to ensure the atomicity of distributed transactions even in the presence of failures. An ACP is said to be non-blocking if it allows correct participants to decide on the transaction despite the failure of others. Several non-blocking protocols have been proposed in the literature. However, none of these protocols...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009